منابع مشابه
On the Roman bondage Number of a Graph
A Roman dominating function on a graph G = (V,E) is a function f : V → {0, 1, 2} such that every vertex v ∈ V with f(v) = 0 has at least one neighbor u ∈ V with f(u) = 2. The weight of a Roman dominating function is the value f(V (G)) = ∑ u∈V (G) f(u). The minimum weight of a Roman dominating function on a graph G is called the Roman domination number, denoted by γR(G). The Roman bondage number...
متن کاملBounds on the restrained Roman domination number of a graph
A {em Roman dominating function} on a graph $G$ is a function$f:V(G)rightarrow {0,1,2}$ satisfying the condition that everyvertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex$v$ for which $f(v) =2$. {color{blue}A {em restrained Roman dominating}function} $f$ is a {color{blue} Roman dominating function if the vertices with label 0 inducea subgraph with no isolated vertex.} The wei...
متن کاملThe bondage number of a graph
The bondage number b(G) of a non empty graph G is the minimum number of edger whose removal from G results in a graph having domination number greater than the domination number of G. In this paper we characterize graphs for which b(G) = p − 1 and b(G) = (γ − 1)+̇1. We also introduce the concept of uniform bondage number bu(G) and determine the exact value of bu(G) for several classes of graphs....
متن کاملbounds on the restrained roman domination number of a graph
a {em roman dominating function} on a graph $g$ is a function$f:v(g)rightarrow {0,1,2}$ satisfying the condition that everyvertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex$v$ for which $f(v) =2$. {color{blue}a {em restrained roman dominating}function} $f$ is a {color{blue} roman dominating function if the vertices with label 0 inducea subgraph with no isolated vertex.} the wei...
متن کاملBondage and Non-bondage Number of a Fuzzy Graph
In this paper, bondage and non-bondage set of a fuzzy graph are discussed. The bondage number b(G) and non-bondage number bn(G) of a fuzzy graph G are defined. The upper bound for both b(G) and bn(G) are given. Also some results on b(G) and bn(G) are discussed. The exact values of b(G) and bn(G) are determined for several classes of fuzzy graphs. AMS Subject Classification: 03E72, 05C40, 05C72
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics, Algorithms and Applications
سال: 2013
ISSN: 1793-8309,1793-8317
DOI: 10.1142/s1793830913500018